Infinite Family Research Articles

Holographic entropy inequalities and the topology of entanglement wedge nesting

We prove two new infinite families of holographic entropy inequalities. A key tool is a graphical arrangement of terms of inequalities that is based on entanglement wedge nesting. It associates the inequalities with tessellations of the torus and the projective plane, which reflect a certain topological aspect of entanglement wedge nesting. The inequalities prove a prior conjecture about the holographic entropy cone. We discuss their relation to black hole physics and differential entropy, and sketch applications to quantum error correction, quantifying randomness of quantum states, and others. Published by the American Physical Society 2024

Harer–Zagier transform of the HOMFLY–PT polynomial for families of twisted hyperbolic knots

In an attempt to generalise knot matrix models for non-torus knots, which currently remains an open problem, we derived expressions for the Harer–Zagier transform—a discrete Laplace transform—of the HOMFLY–PT polynomial for some infinite families of twisted hyperbolic knots. Among them, we found a family of pretzel knots for which, like for torus knots, the transform has a fully factorised form, while for the remaining families considered it consists of sums of factorised terms. Their zero loci show a remarkable structure, which mostly lies on the unit circle and deviates from it only in pairs.

On the algebraic connectivity of some token graphs

AbstractThe k-token graph $$F_k(G)$$ F k ( G ) of a graph G is the graph whose vertices are the k-subsets of vertices from G, two of which are adjacent whenever their symmetric difference is a pair of adjacent vertices in G. It was proved that the algebraic connectivity of $$F_k(G)$$ F k ( G ) equals the algebraic connectivity of G with a proof using random walks and interchange of processes on a weighted graph. However, no algebraic or combinatorial proof is known, and it would be a hit in the area. In this paper, we algebraically prove that the algebraic connectivity of $$F_k(G)$$ F k ( G ) equals the one of G for new infinite families of graphs, such as trees, some graphs with hanging trees, and graphs with minimum degree large enough. Some examples of these families are the following: the cocktail party graph, the complement graph of a cycle, and the complete multipartite graph.

On products of strong Skolem starters

AbstractIn 1991, Shalaby conjectured that any , where or , admits a strong Skolem starter. In 2018, the authors fully described and explicitly constructed the infinite “cardioidal” family of strong Skolem starters. No other infinite family of these combinatorial designs was known to date. Statements regarding the products of starters, proven in this paper give a new way of generating strong or skew Skolem starters of composite orders. This approach extends our previous result by generating new infinite families of these starters that are not cardioidal.

Topological twists of massive SQCD, Part I

We consider topological twists of four-dimensional N=2\\documentclass[12pt]{minimal} \\usepackage{amsmath} \\usepackage{wasysym} \\usepackage{amsfonts} \\usepackage{amssymb} \\usepackage{amsbsy} \\usepackage{mathrsfs} \\usepackage{upgreek} \\setlength{\\oddsidemargin}{-69pt} \\begin{document}$$\\mathcal {N}=2$$\\end{document} supersymmetric QCD with gauge group SU(2) and Nf≤3\\documentclass[12pt]{minimal} \\usepackage{amsmath} \\usepackage{wasysym} \\usepackage{amsfonts} \\usepackage{amssymb} \\usepackage{amsbsy} \\usepackage{mathrsfs} \\usepackage{upgreek} \\setlength{\\oddsidemargin}{-69pt} \\begin{document}$$N_f\\le 3$$\\end{document} fundamental hypermultiplets. The twists are labelled by a choice of background fluxes for the flavour group, which provides an infinite family of topological partition functions. In this Part I, we demonstrate that in the presence of such fluxes the theories can be formulated for arbitrary gauge bundles on a compact four-manifold. Moreover, we consider arbitrary masses for the hypermultiplets, which introduce new intricacies for the evaluation of the low-energy path integral on the Coulomb branch. We develop techniques for the evaluation of these path integrals. In the forthcoming Part II, we will deal with the explicit evaluation.

Emergent symmetries at criticality in multi field RFT/DP

We study multifield extensions of Reggeon Field Theory (also equivalent to Directed Percolation model) at criticality in the perturbative ϵ-expansion below the upper critical dimension Dc = 4 at one loop, for the special case when all fields have the same scale (anomalous) dimensions. Analyzing all the fixed points of the renormalization group flow for N = 2 flavors and some for N = 3, we find scale invariant solutions which are characterized by specific emergent global symmetries of the interacting potential. We also study two infinite families as a function of N having ℤN and SN+1 symmetries.

On Donkin's tilting module conjecture II: counterexamples

In this paper we produce infinite families of counterexamples to Jantzen's question posed in 1980 on the existence of Weyl $p$ -filtrations for Weyl modules for an algebraic group and Donkin's tilting module conjecture formulated in 1990. New techniques to exhibit explicit examples are provided along with methods to produce counterexamples in large rank from counterexamples in small rank. Counterexamples can be produced via our methods for all groups other than when the root system is of type ${\rm A}_{n}$ or ${\rm B}_{2}$ .

Dynamical quantum state tomography with time-dependent channels

Abstract In this paper, we establish a dynamical quantum state tomography framework. Under this framework, it is feasible to obtain complete knowledge of any unknown state of a $d$-level system via only one operator of a special type of positive operator-valued measure (POVM) in dimension $d$. We define a new channel, referred to as the time-dependent average channel. Utilizing this channel, we show that we can acquire a collection of projective operators that is informationally complete (IC) and thus obtain the corresponding informationally complete POVMs (IC-POVMs). Zauner conjectured that for any dimension $d$ there exists a fiducial vector, such that all remaining $d^{2}-1$ elements of the desired symmetric informationally complete POVM (SIC-POVM) can be obtained by acting on said vector with unitary matrices representing elements of the Weyl-Heisenberg group. We show that under certain condition, it is possible to obtain infinite families of projective operators that are IC, and obtain infinite families of corresponding IC-POVMs; otherwise, Zauner's conjecture is incorrect. We also show how to simulate a SIC-POVM on any unknown quantum state by using the time-dependent average channel.

On λ $\lambda $‐backbone coloring of cliques with tree backbones in linear time

AbstractA ‐backbone coloring of a graph with its subgraph (also called a backbone) is a function ensuring that is a proper coloring of and for each it holds that . In this paper we propose a way to color cliques with tree and forest backbones in linear time that the largest color does not exceed . This result improves on the previously existing approximation algorithms as it is ‐absolutely approximate, that is, with an additive error over the optimum. We also present an infinite family of trees with for which the coloring of cliques with backbones requires at least colors for close to . The construction draws on the theory of Fibonacci numbers, particularly on Zeckendorf representations.

Optimal Layout of (Kp − Cp)n into Wheel-Like Networks

The problem of finding the induced subgraph with the maximum number of edges among all subsets of a fixed cardinality is known as the maximum subgraph problem (MSP). The lexicographic order has been proven optimal for Cartesian products of specific regular graphs [B. Sergei, B. Pavle and K. Nikola, New infinite family of regular edge isoperimetric graphs, Theoretical Computer Science 721 (2018) 42–53]. This paper is dedicated to the precise calculation of edge values within the resulting subgraphs, enhancing our comprehension of their structural properties and implications. In this paper, we focus on solving the MSP of [Formula: see text] for any [Formula: see text] and for odd [Formula: see text], [Formula: see text] and [Formula: see text], where [Formula: see text] is obtained by the Cartesian product of a complete graph with [Formula: see text] vertices with a removal of a cycle on [Formula: see text] vertices. It has been observed that the graph obtained by deleting a cycle of length [Formula: see text] from a complete graph [Formula: see text] is isomorphic to a circulant graph [Formula: see text], while the particular case [Formula: see text] has been previously studied in [A. Syeda and M. Rajesh, MinLA of [Formula: see text] and its optimal layout into certain trees, The Journal of Supercomputing (2023), https://doi.org/10.1007/s11227-023-05140-3]. Our work extends the understanding of the MSP to a broader class of graphs with similar properties and applications.

Bipartite Unique Neighbour Expanders via Ramanujan Graphs.

We construct an infinite family of bounded-degree bipartite unique neighbour expander graphs with arbitrarily unbalanced sides. Although weaker than the lossless expanders constructed by Capalbo et al., our construction is simpler and may be closer to being implementable in practice, due to the smaller constants. We construct these graphs by composing bipartite Ramanujan graphs with a fixed-size gadget in a way that generalises the construction of unique neighbour expanders by Alon and Capalbo. For the analysis of our construction, we prove a strong upper bound on average degrees in small induced subgraphs of bipartite Ramanujan graphs. Our bound generalises Kahale's average degree bound to bipartite Ramanujan graphs, and may be of independent interest. Surprisingly, our bound strongly relies on the exact Ramanujan-ness of the graph and is not known to hold for nearly-Ramanujan graphs.

Twisted Kronecker series and periods of modular forms on Γ0(N)

We introduce an infinite family of Kronecker series twisted by characters. As an application, we give a closed formula for the sum of all Hecke eigenforms on Γ0(N) multiplied by their twisted period polynomials in terms of the product of those twisted Kronecker series, when N is square free. This extends an identity of Zagier among period polynomials, Hecke eigenforms and a quotient of Jacobi theta series.

Some properties of classes of minimal numberings of arithmetical set families

We prove that for each u ⩾ 2 the class of all single-valued Σ0 ucomputable numberings of any infinite family of total functions is effectively infinite and the class of all its Σ0 u-1-computable numberings is generated by the downward closure with respect to the reducibility of the set of all infinite direct sums of uniformly Σ0 u-1-computable sequences of its single-valued numberings. It is established that if u > 2, then the class of all Σ0 u-computable numberings of any infinite family is generated by infinite direct sums of uniformly Σ0 u-computable and uniformly Σ0 u-minimal sequences of its numberings.

Anomaly constraints for heterotic strings and supergravity in six dimensions

The landscape of six-dimensional supergravities is dramatically constrained by the cancellation of gauge and gravitational anomalies, but the full extent of its implications has not been uncovered. We explore the cancellation of global anomalies of the Dai-Freed type in this setting with abelian and simply laced gauge groups, finding novel constraints. In particular, we exclude arbitrarily large abelian charges in an infinite family of theories for certain types of quadratic refinements, including a specific one defined in the literature. We also show that the Gepner orientifold with no tensor multiplets is anomaly-free for a different choice, as well as a number of heterotic models with and without spacetime supersymmetry in six dimensions. The latter analysis extends previous results in ten dimensions to some lower-dimensional settings in the heterotic landscape.

New infinite families of congruences for 5-core and 7-core partitions

New infinite families of congruences for 5-core and 7-core partitions

On Fall-Colorable Graphs

A fall k-coloring of a graph G is a proper k-coloring of G such that each vertex has at least one neighbor in each of the other color classes. A graph G which has a fall k-coloring is equivalent to having a partition of the vertex set V(G) in k independent dominating sets. In this paper, we first prove that for any fall k-colorable graph G with order n, the number of edges of G is at least (n(k−1)+r(k−r))/2, where r≡n(modk) and 0≤r≤k−1, and the bound is tight. Then, we obtain that if G is k-colorable (k≥2) and the minimum degree of G is at least k−2k−1n, then G is fall k-colorable and this condition of minimum degree is the best possible. Moreover, we give a simple proof for an NP-hard result of determining whether a graph is fall k-colorable, where k≥3. Finally, we show that there exist an infinite family of fall k-colorable planar graphs for k∈{5,6}.

Lorentzian threads and generalized complexity

Recently, an infinite class of holographic generalized complexities was proposed. These gravitational observables display the behavior required to be duals of complexity, in particular, linear growth at late times and switchback effect. In this work, we aim to understand generalized complexities in the framework of Lorentzian threads. We reformulate the problem in terms of thread distributions and measures and present a program to calculate the infinite family of codimension-one observables. We also outline a path to understand, using threads, the more subtle case of codimension-zero observables.

Locating-dominating number of certain infinite families of convex polytopes with applications

A convex hull of finitely many points in the Euclidean space Rd is known as a convex polytope. Graphically, they are planar graphs i.e. embeddable on R2. Minimum dominating sets possess diverse applications in computer science and engineering. Locating-dominating sets are a natural extension of dominating sets. Studying minimizing locating-dominating sets of convex polytopes reveal interesting distance-dominating related topological properties of these geometrical planar graphs. In this paper, exact value of the locating-dominating number is shown for one infinite family of convex polytopes. Moreover, tight upper bounds on γl−d are shown for two more infinite families. Tightness in the upper bounds is shown by employing an updated integer linear programming (ILP) model for the locating-dominating number γl−d of a fixed graph. Results are explained with help of some examples. The second part of the paper solves an open problem in [S. Khan, Int. J. Quantum Chem., 123(20) (2023) e27192.] which asks to find a domination-related parameter which delivers a correlation coefficient of ρ>0.9967 with the total π-electronic energy of lower benzenoid hydrocarbons. We show that the locating-dominating number γl−d delivers such a strong prediction potential. The paper is concluded with putting forward some open problems in this area.

An Infinite Family of Binary Cyclic Codes With Best Parameters

An Infinite Family of Binary Cyclic Codes With Best Parameters

Microscopic Origin of the Entropy of Astrophysical Black Holes.

We construct an infinite family of microstates for black holes in Minkowski spacetime which have effective semiclassical descriptions in terms of collapsing dust shells in the black hole interior. Quantum mechanical wormholes cause these states to have exponentially small, but universal, overlaps. We show that these overlaps imply that the microstates span a Hilbert space of log dimension equal to the event horizon area divided by four times the Newton constant, explaining the statistical origin of the Bekenstein-Hawking entropy.